Beyond Polyhedral Homotopies
نویسندگان
چکیده
We present a new algorithmic framework which utilizes tropical geometry and homotopy continuation for solving systems of polynomial equations where some of the polynomials are generic elements in linear subspaces of the polynomial ring. This approach generalizes the polyhedral homotopies by Huber and Sturmfels.
منابع مشابه
Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
Polyhedral homotopy continuation methods exploit the sparsity of polynomial systems so that the number of solution curves to reach all isolated solutions is optimal for generic systems. The numerical stability of tracing solution curves of polyhedral homotopies is mainly determined by the height of the powers of the continuation parameter. To reduce this height we propose a procedure that opera...
متن کاملToric Newton Method for Polynomial Homotopies
This paper deenes a generalization of Newton's method to deal with solution paths de-ned by polynomial homotopies that lead to extremal values. Embedding the solutions in a toric variety leads to explicit scaling relations between coeecients and solutions. Toric Newton is a symbolic-numeric algorithm where the symbolic pre-processing exploits the polyhedral structures. The numerical stage uses ...
متن کاملNumerical Evidence for a Conjecture in Real Algebraic Geometry
Homotopies for polynomial systems provide computational evidence for a challenging instance of a conjecture about whether all solutions are real. The implementation of SAGBI homotopies involves polyhedral continuation, at deformation and cheater's ho-motopy. The numerical diiculties are overcome if we work in the true synthetic spirit of the Schubert calculus by selecting the numerically most f...
متن کاملA Special Homotopy Continuation Method for a Class of Polynomial Systems
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of this method is between the total degree bound and the mixed volume bound and can be easily computed. The new algorithm has been implemented as a program called ...
متن کاملCMPSm : A Continuation Method for Polynomial Systems
CMPSm is a MATLAB program using a predictor-corrector path-following method for tracing homotopy curves to approximate all isolated solutions of a system of polynomial equations. The program was originally developed for cheater’s homotopy, but it can be also used for linear and polyhedral homotopies. The latest version CMPSm2 of this software, this manual and some numerical examples are availab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1706.03520 شماره
صفحات -
تاریخ انتشار 2017